Kerov's interlacing sequences and random matrices
نویسندگان
چکیده
منابع مشابه
Self-interlacing polynomials II: Matrices with self-interlacing spectrum
An n×n matrix is said to have a self-interlacing spectrum if its eigenvalues λk , k = 1, . . . ,n, are distributed as follows: λ1 >−λ2 > λ3 > · · ·> (−1)λn > 0. A method for constructing sign definite matrices with self-interlacing spectrum from totally nonnegative ones is presented. This method is applied to bidiagonal and tridiagonal matrices. In particular, a result by O. Holtz on the spectr...
متن کاملGraphs and Hermitian matrices: Exact interlacing
We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient: In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest eigenvalue of a graph. Keywords: extreme eigenvalues, tight interlacing, graph Laplacian, singular values, nonnegative matrix 1 Introduction Our notation is st...
متن کاملGraphs and Hermitian matrices: eigenvalue interlacing
Our first aim in this note is to prove some inequalities relating the eigenvalues of a Hermitian matrix with the eigenvalues of its principal matrices induced by a partition of the index set. One of these inequalities extends an inequality proved by Hoffman in [9]. Secondly, we apply our inequalities to estimate the eigenvalues of the adjacency matrix of a graph, and prove, in particular, that ...
متن کاملAsymptotically Liberating Sequences of Random Unitary Matrices
A fundamental result of free probability theory due to Voiculescu and subsequently refined by many authors states that conjugation by independent Haar-distributed random unitary matrices delivers asymptotic freeness. In this paper we exhibit many other systems of random unitary matrices that, when used for conjugation, lead to freeness. We do so by first proving a general result asserting “asym...
متن کاملInterlacing Inequalities for Totally Nonnegative Matrices
Suppose λ1 ≥ · · · ≥ λn ≥ 0 are the eigenvalues of an n × n totally nonnegative matrix, and λ̃1 ≥ · · · ≥ λ̃k are the eigenvalues of a k × k principal submatrix. A short proof is given of the interlacing inequalities: λi ≥ λ̃i ≥ λi+n−k, i = 1, . . . , k. It is shown that if k = 1, 2, n− 2, n− 1, λi and λ̃j are nonnegative numbers satisfying the above inequalities, then there exists a totally nonneg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2013
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.4830024